Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
211	Almost partitioning any 3-edge-coloured Kn,n into 5 monochromatic cycles Richard Lang, Oliver Schaudt, Maya Stein∗ 30th SeptemberAbstract Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-09-30 15:39:15 NP-complete problems Combinatorial optimization Graph coloring Matching Cycle Bipartite graph Graph
212	WeilSchaudt_DeltaChi_GaC.dvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-06-05 05:09:32 Graph theory Graph coloring NP-complete problems Graph operations Perfect graph theorem Line graph Perfect graph Clique Bipartite graph Triangle-free graph Strong perfect graph theorem Graph minor
213	Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2013-03-23 01:40:10 Graph theory NP-complete problems Graph coloring Graph Global Positioning System Random graph
214	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
215	Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ all possible schedules has been shown to be discretizable and reducible to a finite graph, which can be explored systematically to find a s Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2013-06-13 22:40:09
216	Exercise 1: Graphing Experimental Data In this exercise, you are given a complete data set from an experiment. You are asked to graph that data and to prepare a short report describing that data, and displaying your grap Add to Reading List Source URL: www.writing.engr.psu.edu Language: English - Date: 2000-07-10 15:14:34
217	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-06-25 05:19:55 Graph theory NP-complete problems Graph operations Clique Degeneracy Tree Degree Vertex Neighbourhood Clique problem BronKerbosch algorithm
218	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
219	Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2 Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-06-09 08:58:15 Graph theory NP-complete problems Dense subgraph Clique BronKerbosch algorithm Cograph Modular product of graphs
220	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree

UPDATE